Network theory

Results: 5621



#Item
681Edsger W. Dijkstra / Network theory / Shortest path problem / FO / Topology / Combinatory logic

IEEE TRANSACTIONS 888 ON CIRCUITS

Add to Reading List

Source URL: isl.stanford.edu

Language: English - Date: 2004-09-20 19:09:46
682Scheduling algorithms / Operations research / Network performance / Queueing theory / Scheduling computing) / Abstract data types / Planning / Scheduling / Multilevel feedback queue / Fair queuing / Job scheduler / Priority queue

Efficient Coflow Scheduling Without Prior Knowledge Mosharaf Chowdhury, Ion Stoica UC Berkeley {mosharaf, istoica}@cs.berkeley.edu

Add to Reading List

Source URL: www.mosharaf.com

Language: English - Date: 2015-06-27 17:54:08
683Combinatorial optimization / Graph theory / NP-complete problems / Network theory / Edsger W. Dijkstra / Steiner tree problem / Simplex / Matching / Bipartite graph / Graph / Shortest path problem / A* search algorithm

On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

Add to Reading List

Source URL: www.cs.rpi.edu

Language: English - Date: 2011-07-18 11:44:43
684Statistics / Machine learning / Nonparametric statistics / Estimation theory / Computational statistics / Kernel density estimation / Pattern recognition / Artificial neural network / Mixture model / Density estimation / Inverse problem / Maximum a posteriori estimation

sm_reg_surface_noisy_60_b.eps

Add to Reading List

Source URL: dpkingma.com

Language: English - Date: 2013-03-07 08:16:36
685Coding theory / Error detection and correction

NETWORK INFORMATION THEORY OMISSIONS TO ALL PRINTINGS p. , Bibliographic Notes, line  should read: The capacity region of the deterministic broadcast channel was established independently by Marton (

Add to Reading List

Source URL: isl.stanford.edu

Language: English - Date: 2012-10-31 10:57:08
686Graph theory / Mathematics / Computational complexity theory / Network theory / Spanning tree / NP-complete problems / Edsger W. Dijkstra / Shortest path problem / Longest path problem / Minimum spanning tree / Reverse-delete algorithm

December 15, Fall 2008 Final Examination Introduction to Algorithms Massachusetts Institute of Technology

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2009-05-07 21:09:13
687Statistics / Statistical theory / Monte Carlo software / Computational statistics / Statistical inference / Bayesian statistics / Bayesian network / Stan / Markov chain Monte Carlo / WinBUGS / Bayesian inference using Gibbs sampling / Bayesian inference

Title Bayesian modeling using Stan Abstract The goal of this course is to assist researchers in learning to use Stan to perform Bayesian inference with applications to multilevel modeling and item response theory. The co

Add to Reading List

Source URL: www.psychometricsociety.org

Language: English - Date: 2016-02-11 12:46:42
688Graph theory / Mathematics / Algebraic graph theory / Network analysis / Graph connectivity / Networks / Graph operations / Line graph / Conductance / Clique / Community structure / Graph partition

Overlapping Community Detection Using Seed Set Expansion Joyce Jiyoung Whang David F. Gleich

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2013-09-05 18:39:07
689Operations research / Computing / Network performance / Business / Queueing theory / Probability theory / Computer networking / Data transmission / Transmission time / Queuing delay / Schedule / Transmission Control Protocol

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 10, NO. 4, AUGUSTEnergy-Efficient Packet Transmission Over a Wireless Link

Add to Reading List

Source URL: isl.stanford.edu

Language: English - Date: 2004-09-20 19:09:51
690Cryptography / Algebra / Public-key cryptography / Pairing-based cryptography / Elliptic curves / Group theory / Analytic number theory / Weil pairing / Divisor / Pairing / Homomorphic signatures for network coding

Exercises on pairings on elliptic curves Andreas Enge Leuven, Friday, 13 September 2013 Exercise 1 (Weil reciprocity). Let E : Y 2 = X 3 + X over F7 , f = Y , g = X−1 X−3 . Compute div f and div g, and verify that f

Add to Reading List

Source URL: www.cosic.esat.kuleuven.be

Language: English - Date: 2013-09-23 05:41:31
UPDATE